An Experimental Study and Analysis of Crowds based Anonymity
نویسندگان
چکیده
Crowds provides probable innocence in the face of large number of attackers. In this paper, we present the experimental results of the behavior of Crowds in a dense network. We begin by providing a brief description about Crowds followed by the experimental environment in which the simulations were carried out. We then present the results of our simulations and the inferences made out of them. We will also show that the obtained results match the predictions
منابع مشابه
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of group members and the adversary is modeled as a discrete-time Markov chain, and security properties are expressed as PCTL formulas. To illustrate feasibility of the approach, we model the Crowds system for anonymous Web...
متن کاملThe Dangers of Composing Anonymous Channels
We present traffic analyses of two anonymous communications schemes that build on the classic Crowds/Hordes protocols. The AJSS10 [1] scheme combines multiple Crowds-like forward channels with a Hordes reply channel in an attempt to offer robustness in a mobile environment. We show that the resulting scheme fails to guarantee the claimed k-anonymity, and is in fact more vulnerable to malicious ...
متن کاملTrust in Crowds: Probabilistic Behaviour in Anonymity Protocols
The existing analysis of the Crowds anonymity protocol assumes that a participating member is either ‘honest’ or ‘corrupted’. This paper generalises this analysis so that each member is assumed to maliciously disclose the identity of other nodes with a probability determined by her vulnerability to corruption. Within this model, the trust in a principal is defined to be the probability that she...
متن کاملThe Wisdom of Crowds: Attacks and Optimal Constructions
We present a traffic analysis of the ADU anonymity scheme presented at ESORICS 2008, and the related RADU scheme. We show that optimal attacks are able to de-anonymize messages more effectively than believed before. Our analysis applies to single messages as well as long term observations using multiple messages. The search of a “better” scheme is bound to fail, since we prove that the original...
متن کاملAnonymity Metrics Revisited
In 2001, two information theoretic anonymity metrics were proposed: the effective anonymity set size and the degree of anonymity. Here, we propose an abstract model for a general anonymity system which is consistent with the definition of anonymity on which the metrics are based. We revisit entropybased anonymity metrics, and we apply them to Crowds, a practical anonymity system. We discuss the...
متن کامل